Then we propose a union algorithm to combine two sets of implication rules for the requirement of distributed applications 在此基础上,针对分布式应用的需要,合肥工业大学硕士学位论文我们提出一种蕴涵规则的并运算算法,考虑如何将两组蕴涵规则集加以合并。
4 ) we introduce a classical algorithm which can extract implication rules based on concept lattice . the algorithm builds lattice incrementally and updates the set of rules simultaneously . we modify the structure of lattic to meet our requirement of finding frequent itemsets (4)介绍一种经典的基于概念格的提取蕴涵规则的算法,该算法增量式建格,同时更新规则集,我们根据需要对格结构进行相应修改,从而可以增量式获取频繁项集。